A consistent stabilized formulation for a nonsymmetric saddle-point problem
نویسنده
چکیده
In this report we study the stability of a nonsymmetric saddle-point problem. It is discretized with equal order finite elements and stabilized with a consistent regularization. In this way we achieve a stable finite element discretization of optimal order approximation properties.
منابع مشابه
Generalized iterative methods for solving double saddle point problem
In this paper, we develop some stationary iterative schemes in block forms for solving double saddle point problem. To this end, we first generalize the Jacobi iterative method and study its convergence under certain condition. Moreover, using a relaxation parameter, the weighted version of the Jacobi method together with its convergence analysis are considered. Furthermore, we extend a method...
متن کاملAn Absolutely Stabilized Finite Element Method for the Stokes Problem
An absolutely stabilized finite element formulation for the Stokes problem is presented in this paper. This new formulation, which is nonsymmetric but stable without employment of any stability constant, can be regarded as a modification of the formulation proposed recently by Hughes and Franca in [8]. Optimal error estimates in L2-norm for the new stabilized finite element approximation of bot...
متن کاملOn the eigenvalues and eigenvectors of nonsymmetric saddle point matrices preconditioned by block triangular matrices
Block lower triangular and block upper triangular matrices are popular preconditioners for nonsymmetric saddle point matrices. In this note we show that a block lower triangular preconditioner gives the same spectrum as a block upper triangular preconditioner and that the eigenvectors of the two preconditioned systems are related. Nonsingular saddle point matrices of the form
متن کاملA Generalization of Local Symmetric and Skew-symmetric Splitting Iteration Methods for Generalized Saddle Point Problems
In this paper, we further investigate the local Hermitian and skew-Hermitian splitting (LHSS) iteration method and the modified LHSS (MLHSS) iteration method for solving generalized nonsymmetric saddle point problems with nonzero (2,2) blocks. When A is non-symmetric positive definite, the convergence conditions are obtained, which generalize some results of Jiang and Cao [M.-Q. Jiang and Y. Ca...
متن کاملAn Augmented Lagrangian-Based Approach to the Oseen Problem
We describe an effective solver for the discrete Oseen problem based on an augmented Lagrangian formulation of the corresponding saddle point system. The proposed method is a block triangular preconditioner used with a Krylov subspace iteration like BiCGStab. The crucial ingredient is a novel multigrid approach for the (1,1) block, which extends a technique introduced by Schöberl for elasticity...
متن کامل